Search algorithm

Results: 1615



#Item
11A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

Add to Reading List

Source URL: chargueraud.org

Language: English - Date: 2015-09-30 09:17:22
    12Jr. of Industrial Pollution Controlppwww.icontrolpollution.com Research Article HYBRIDIZATION OF GENETIC ALGORITHM & VARIABLE NEIGHBORHOOD SEARCH (VNGA) APPROACH TO CRACK THE FLEXIBLE JOB SHOP

    Jr. of Industrial Pollution Controlppwww.icontrolpollution.com Research Article HYBRIDIZATION OF GENETIC ALGORITHM & VARIABLE NEIGHBORHOOD SEARCH (VNGA) APPROACH TO CRACK THE FLEXIBLE JOB SHOP

    Add to Reading List

    Source URL: www.icontrolpollution.com

    Language: English - Date: 2018-01-18 04:14:27
      13A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

      A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

      Add to Reading List

      Source URL: www.chargueraud.org

      - Date: 2015-09-30 09:17:22
        14________________________________ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem Gerardo Berbeglia Jean-François Cordeau

        ________________________________ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem Gerardo Berbeglia Jean-François Cordeau

        Add to Reading List

        Source URL: www.cirrelt.ca

        - Date: 2010-03-26 11:44:16
          15In the Search of Improvements to the EL+ Classification Algorithm Barı¸s Sertkaya Abstract. We investigate possible improvements to the existing algorithm for classifying EL+ TBoxes. We p

          In the Search of Improvements to the EL+ Classification Algorithm Barı¸s Sertkaya Abstract. We investigate possible improvements to the existing algorithm for classifying EL+ TBoxes. We p

          Add to Reading List

          Source URL: ceur-ws.org

          - Date: 2011-06-26 10:23:36
            16Appendix - Algorithm for expansion policy Algorithm 1: Search candidates for named entities and expansion policy Data: N = {N1 , N2Nn } sorted in ascending order of their string length, trigram similarity threshol

            Appendix - Algorithm for expansion policy Algorithm 1: Search candidates for named entities and expansion policy Data: N = {N1 , N2Nn } sorted in ascending order of their string length, trigram similarity threshol

            Add to Reading List

            Source URL: titan.informatik.uni-leipzig.de

            - Date: 2014-07-10 08:59:07
              17In Search of an Understandable Consensus Algorithm

              In Search of an Understandable Consensus Algorithm

              Add to Reading List

              Source URL: ongardie.net

              - Date: 2014-10-23 02:16:26
                18The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

                The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

                Add to Reading List

                Source URL: ciim.usf.edu

                - Date: 1980-01-01 00:00:00
                  19TOP REFERENCES E.H.L. Aarts and J.K. Lenstra (editors), Local search in combinatorial optimization. Wiley, (C.J. Adcock and N. Meade, A simple algorithm to incorporate transaction costs in quadratic optimisation.

                  TOP REFERENCES E.H.L. Aarts and J.K. Lenstra (editors), Local search in combinatorial optimization. Wiley, (C.J. Adcock and N. Meade, A simple algorithm to incorporate transaction costs in quadratic optimisation.

                  Add to Reading List

                  Source URL: www.aiinfinance.com

                  - Date: 2012-06-26 15:05:22
                    20A Statistical Analysis of the Features of a Hybrid Local Search Algorithm For Course Timetabling Problems Ruggero Bellio1 and Luca Di Gaspero2 , Andrea Schaerf2 1

                    A Statistical Analysis of the Features of a Hybrid Local Search Algorithm For Course Timetabling Problems Ruggero Bellio1 and Luca Di Gaspero2 , Andrea Schaerf2 1

                    Add to Reading List

                    Source URL: ceur-ws.org

                    - Date: 2008-12-05 17:34:33